A New Large Cardinal and Laver Sequences for Extendibles
نویسنده
چکیده
We define a new large cardinal axiom that fits between A3 and A4 in the hierarchy of axioms described in [SRK]. We use this new axiom to obtain a Laver sequence for extendible cardinals, improving the known large cardinal upper bound for the existence of such sequences.
منابع مشابه
Laver Sequences for Extendible and Super-Almost-Huge Cardinals
Versions of Laver sequences are known to exist for supercompact and strong cardinals. Assuming very strong axioms of infinity, Laver sequences can be constructed for virtually any globally defined large cardinal not weaker than a strong cardinal; indeed, under strong hypotheses, Laver sequences can be constructed for virtually any regular class of embeddings. We show here that if there is a reg...
متن کاملThe Lottery Preparation Joel
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery preparation makes these cardinals indestructible by various kinds of further forcing. A supercompact cardinal κ, for example, becomes fully indestructible b...
متن کاملThe Lottery Preparation
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery preparation makes these cardinals indestructible by various kinds of further forcing. A supercompact cardinal κ, for example, becomes fully indestructible b...
متن کاملA class of strong diamond principles
In the context of large cardinals, the classical diamond principle 3κ is easily strengthened in natural ways. When κ is a measurable cardinal, for example, one might ask that a 3κ sequence anticipate every subset of κ not merely on a stationary set, but on a set of normal measure one. This is equivalent to the existence of a function ` ... κ → Vκ such that for any A ∈ H(κ) there is an embedding...
متن کاملGuessing models and generalized Laver diamond
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from supercompactness to rank-to-rank embeddings. The majority of these large cardinals properties can be defined in terms of suitable elementary embeddings j : ...
متن کامل